Hamiltonicity of 3-connected line graphs
نویسندگان
چکیده
منابع مشابه
Hamiltonicity of 3-connected line graphs
Thomassen conjectured that every 4-connected line graph is Hamiltonian. Lai et al. conjectured [H. Lai, Y. Shao, H. Wu, J. Zhou, Every 3-connected, essentially 11-connected line graph is Hamiltonian, J. Combin. Theory Ser. B 96 (2006) 571–576] that every 3-connected, essentially 4-connected line graph is Hamiltonian. In this note, we first show that the conjecture posed by Lai et al. is not tru...
متن کاملHamiltonicity of 3-connected generalized bull-free line graphs
For graphs G and H, G is said to be H-free if G has no induced subgraph isomorphic to H. For integers s and t with 1 ≤ s ≤ t, let Bs,t be a graph obtained by attaching each of some two distinct vertices of a triangle to an end vertex of one of two vertex-disjoint paths of orders s and t. In this paper, we prove that every 3-connected Bs,9−s-free line graph is Hamiltonian for an integer s with 1...
متن کاملHamiltonicity in 3-connected claw-free graphs
Kuipers and Veldman conjectured that any 3-connected claw-free graph with order ν and minimum degree δ ≥ ν+6 10 is Hamiltonian for ν sufficiently large. In this paper, we prove that if H is a 3-connected claw-free graph with sufficiently large order ν, and if δ(H) ≥ ν+5 10 , then either H is hamiltonian, or δ(H) = ν+5 10 and the Ryjác̆ek’s closure cl(H) of H is the line graph of a graph obtained...
متن کاملHamiltonicity in connected regular graphs
In 1980, Jackson proved that every 2-connected k-regular graph with at most 3k vertices is Hamiltonian. This result has been extended in several papers. In this note, we determine the minimum number of vertices in a connected k-regular graph that is not Hamiltonian, and we also solve the analogous problem for Hamiltonian paths. Further, we characterize the smallest connected k-regular graphs wi...
متن کاملHamiltonicity of Cubic 3-Connected k-Halin Graphs
We investigate here how far we can extend the notion of a Halin graph such that hamiltonicity is preserved. Let H = T ∪ C be a Halin graph, T being a tree and C the outer cycle. A k-Halin graph G can be obtained from H by adding edges while keeping planarity, joining vertices of H − C, such that G − C has at most k cycles. We prove that, in the class of cubic 3-connected graphs, all 14-Halin gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2012
ISSN: 0893-9659
DOI: 10.1016/j.aml.2012.02.032